Essential unifiers
نویسندگان
چکیده
منابع مشابه
Computing Minimal EL-unifiers is Hard
Unification has been investigated both in modal logics and in description logics, albeit with different motivations. In description logics, unification can be used to detect redundancies in ontologies. In this context, it is not sufficient to decide unifiability, one must also compute appropriate unifiers and present them to the user. For the description logic EL, which is used to define severa...
متن کاملTransparent Unifiers in Modal Logics with Self-conjugate Operators
It is shown that weakly transitive normal modal logics containing D : ♦>, with (definable) self-conjugate operators in the sense of Jonsson and Tarski have transparent unifiers, hence, unitary unification. There are continuummany such logics. Transparent unifiers are given in a simple explicit form. In logics with transparent unifiers every admissible rule with unifiable premises is derivable, ...
متن کاملOn unifiers, diversifiers, and the nature of pattern recognition
We study a dichotomy of scientific styles, unifying and diversifying, as proposed by Freeman J. Dyson. We discuss the extent to which the dichotomy transfers from the natural sciences (where Dyson proposed it) to the field of Pattern Recognition. To address this we must firstly ask what it means to be a “unifier” or “diversifier” in a field, and what are the relative merits of each style of thi...
متن کاملAC-Superposition with Constraints: No AC-Unifiers Needed
We prove the completeness of (basic) deduction strategies with constrained clauses modulo associativity and commutativity (AC). Here each inference generates one single conclusion with an additional equality s = AC t in its constraint (instead of one conclusion for each minimal AC-uniier, i.e. exponentially many). Furthermore, computing AC-uniiers is not needed at all. A clause C T ] ] is redun...
متن کاملA Formalization of the Theorem of Existence of First-Order Most General Unifiers
This work presents a formalization of the theorem of existence of most general unifiers in first-order signatures in the higher-order proof assistant PVS. The distinguishing feature of this formalization is that it remains close to the textbook proofs that are based on proving the correctness of the wellknown Robinson’s first-order unification algorithm. The formalization was applied inside a P...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Logic
سال: 2006
ISSN: 1570-8683
DOI: 10.1016/j.jal.2004.12.001